منابع مشابه
From Mapping Class Groups to Automorphism Groups of Free Groups
It is shown that the natural map from the mapping class groups of surfaces to the automorphism groups of free groups induces an infinite loop map on the classifying spaces of the stable groups after plus construction. The proof uses automorphisms of free groups with boundaries which play the role of mapping class groups of surfaces with several boundary components.
متن کاملInfinitely Generated Free Nilpotent Groups: Completeness of the Automorphism Groups
Baumslag conjectured in the 1970s that the automorphism tower of a finitely generated free group (free nilpotent group) must be very short. Dyer and Formanek [9] justified the conjecture concerning finitely generated free groups in the “sharpest sense” by proving that the automorphism group Aut(Fn) of a non-abelian free group Fn of finite rank n is complete. Recall that a group G is said to be ...
متن کاملGeometry for palindromic automorphism groups of free groups
We examine the palindromic automorphism group ΠA(Fn) of a free group Fn, a group first defined by Collins in [5] which is related to hyperelliptic involutions of mapping class groups, congruence subgroups of SLn(Z), and symmetric automorphism groups of free groups. Cohomological properties of the group are explored by looking at a contractible space on which ΠA(Fn) acts properly with finite quo...
متن کاملAUTOMORPHISM GROUP OF GROUPS OF ORDER pqr
H"{o}lder in 1893 characterized all groups of order $pqr$ where $p>q>r$ are prime numbers. In this paper, by using new presentations of these groups, we compute their full automorphism group.
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 2008
ISSN: 1446-7887,1446-8107
DOI: 10.1017/s1446788708000918